Data Types and Structures

10.1 Data Types and Records

Candidates should be able to:

1. Select and use appropriate data types for a problem solution

Notes and guidance

including integer, real, char, string, Boolean, date (pseudocode will use the following data types: INTEGER, REAL, CHAR, STRING, BOOLEAN, DATE, ARRAY, FILE)

2. Show understanding of the purpose of a record structure to hold a set of data of different data types under one identifier

Notes and guidance

1. Write pseudocode to define a record structure
2. Write pseudocode to read data from a record structure and save data to a record structure

10.2 Arrays

Candidates should be able to:

1. Use the technical terms associated with arrays

Notes and guidance

Including index, upper and lower bound

2. Select a suitable data structure (1D or 2D array) to use for a given task
3. Write pseudocode for 1D and 2D arrays
4. Write pseudocode to process array data

Notes and guidance

1. Sort using a bubble sort
2. Search using a linear search

10.3 Files

Candidates should be able to:

1. Show understanding of why files are needed
2. Write pseudocode to handle text files that consist of one or more lines

10.4 Introduction to Abstract Data Types (ADT)

Candidates should be able to:

1. Show understanding that an ADT is a collection of data and a set of operations on those data
2. Show understanding that a stack, queue and linked list are examples of ADTs

Notes and guidance

Describe the key features of a stack, queue and linked list and justify their use for a given situation

3. Use a stack, queue and linked list to store data

Notes and guidance

Candidates will not be required to write pseudocode for these structures, but they should be able to add, edit and delete data from these structures

4. Describe how a queue, stack and linked list can be implemented using arrays